A note on V-free 2-matchings
نویسندگان
چکیده
Motivated by a conjecture of Liang, we introduce a restricted path packing problem in bipartite graphs that we call a V-free 2-matching. We verify the conjecture through a weakening of the hypergraph matching problem. We close the paper by showing that it is NP-complete to decide whether one of the color classes of a bipartite graph can be covered by a V-free 2-matching.
منابع مشابه
A Note on $\mathtt{V}$-free 2-matchings
Motivated by a conjecture of Liang [Y.-C. Liang. Anti-magic labeling of graphs. PhD thesis, National Sun Yat-sen University, 2013.], we introduce a restricted path packing problem in bipartite graphs that we call a V-free 2-matching. We verify the conjecture through a weakening of the hypergraph matching problem. We close the paper by showing that it is NP-complete to decide whether one of the ...
متن کاملPerfect Matchings in Edge-Transitive Graphs
We find recursive formulae for the number of perfect matchings in a graph G by splitting G into subgraphs H and Q. We use these formulas to count perfect matching of P hypercube Qn. We also apply our formulas to prove that the number of perfect matching in an edge-transitive graph is , where denotes the number of perfect matchings in G, is the graph constructed from by deleting edges with an en...
متن کاملGlobal Forcing Number for Maximal Matchings under Graph Operations
Let $S= \{e_1,\,e_2, \ldots,\,e_m\}$ be an ordered subset of edges of a connected graph $G$. The edge $S$-representation of an edge set $M\subseteq E(G)$ with respect to $S$ is the vector $r_e(M|S) = (d_1,\,d_2,\ldots,\,d_m)$, where $d_i=1$ if $e_i\in M$ and $d_i=0$ otherwise, for each $i\in\{1,\ldots , k\}$. We say $S$ is a global forcing set for maximal matchings of $G$ if $...
متن کاملTriangle-free 2-matchings and M-concave functions on jump systems
For an undirected graph and a fixed integer k, a 2-matching is said to be Ck-free if it has no cycle of length k or less. The problem of finding a maximum cardinality Ck-free 2-matching is polynomially solvable when k ≤ 3, and NP-hard when k ≥ 5. It is known that the polynomial solvability of this problem is closely related to jump systems. Indeed, the degree sequences of the Ck-free 2-matching...
متن کاملA Note on Perfect Matchings in Uniform Hypergraphs
We determine the exact minimum `-degree threshold for perfect matchings in kuniform hypergraphs when the corresponding threshold for perfect fractional matchings is significantly less than 12 ( n k−` ) . This extends our previous results that determine the minimum `-degree thresholds for perfect matchings in k-uniform hypergraphs for all ` > k/2 and provides two new (exact) thresholds: (k, `) =...
متن کامل